Edit Distance in Graphs
نویسنده
چکیده
The focus of my research is extremal graph theory and random combinatorial structures. I have also worked in a variety of other areas, including intersecting hypergraphs, the theory of positional games and Ramsey theory. I use a number of tools in my research, notably probabilistic methods and, most prominently, Szemerédi’s regularity lemma. I have used these and other techniques to address questions related to graphs, hypergraphs and combinatorial structures. The following is a summary of some major facets of my research. I cannot cover all of the papers adequately, but I hope to summarize some of the major themes. Reference numbers correspond to the numbering of the papers in my CV and the reference numbers are hyperlinks to a preprint of the referenced manuscript.
منابع مشابه
An Error-Tolerant Approximate Matching Algorithm for Attributed Planar Graphs and Its Application to Fingerprint Classification
Graph edit distance is a powerful error-tolerant similarity measure for graphs. For pattern recognition problems involving large graphs, however, the high computational complexity makes it sometimes impossible to apply edit distance algorithms. In the present paper we propose an efficient algorithm for edit distance computation of planar graphs. Given graphs embedded in the plane, we iterativel...
متن کاملThe edit distance for Reeb graphs of surfaces
Reeb graphs are structural descriptors that capture shape properties of a topological space from the perspective of a chosen function. In this work we define a combinatorial metric for Reeb graphs of orientable surfaces in terms of the cost necessary to transform one graph into another by edit operations. The main contributions of this paper are the stability property and the optimality of this...
متن کاملA Quadratic Programming Approach to the Graph Edit Distance Problem
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost edit path between graphs, we introduce the notion of fuzzy edit paths between graphs and provide a quadratic programming formulation for the minimization of fuzzy edit costs. Experiments on real-world graph data demonstr...
متن کاملSelf-organizing Graph Edit Distance
This paper addresses the issue of learning graph edit distance cost functions for numerically labeled graphs from a corpus of sample graphs. We propose a system of self-organizing maps representing attribute distance spaces that encode edit operation costs. The selforganizing maps are iteratively adapted to minimize the edit distance of those graphs that are required to be similar. To demonstra...
متن کاملThe edit distance in graphs: methods, results and generalizations
The edit distance is a very simple and natural metric on the space of graphs. In the edit distance problem, we fix a hereditary property of graphs and compute the asymptotically largest edit distance of a graph from the property. This quantity is very difficult to compute directly but in many cases, it can be derived as the maximum of the edit distance function. Szemerédi’s regularity lemma, st...
متن کاملEdit Distance From Graph Spectra
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the formality and rigour of the computation of string edit distance. Hence, our aim is to convert graphs to string sequences so that standard string edit distance techniques can be used. To do this we use graph spectral seri...
متن کامل